翻訳と辞書 |
Lawson topology : ウィキペディア英語版 | Lawson topology In mathematics and theoretical computer science the Lawson topology, named after J. D. Lawson, is a topology on partially ordered sets used in the study of domain theory. The lower topology on a poset ''P'' is generated by the subbasis consisting of all complements of principal filters on ''P''. The Lawson topology on ''P'' is the smallest common refinement of the lower topology and the Scott topology on ''P''. == Properties ==
* If ''P'' is a complete upper semilattice, the Lawson topology on ''P'' is always a complete ''T''1 topology.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Lawson topology」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|